Exterior Path Relinking for Zero-One Optimization
نویسنده
چکیده
Path relinking (PR) maintains a reference set of elite and diverse solutions, and generates new solutions between and beyond initiating and guiding solutions selected from this set as a foundation for an evolutionary solution process. However, in spite of the widespread application of path relinking in combinatorial optimization, almost all PR implementations only consider the between-form of PR. This note discusses the beyondform of path relinking, which we call Exterior Path Relinking, and focuses on its relevance for diversification strategies in binary optimization. Finally, we also observe how to combine the Exterior (beyond) and Interior (between) forms of path relinking.
منابع مشابه
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization
We propose several new hybrid heuristics for the differential dispersion problem, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all pairs of eli...
متن کاملGrasp with Exterior Path Relinking for Differential Dispersion Minimization
We propose several new hybrid heuristics for the differential dispersion problem are proposed, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all...
متن کاملGRASP with Path Relinking for Three-Index Assignment
T paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explores tr...
متن کاملGrasp with Path Relinking for the Three-index Assignment Problem
Abstract. This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explor...
متن کاملA Template for Scatter Search and Path Relinking
Scatter search and its generalized form called path relinking are evolutionary methods that have recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, these methods use strategies for combining solution vectors that have proved eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. of Applied Metaheuristic Computing
دوره 5 شماره
صفحات -
تاریخ انتشار 2014